منابع مشابه
Hankel Operators on the Bergman Space of Bounded Symmetric Domains
Let ii be a bounded symmetric domain in C with normalized 2 volume measure dV . Let P be the orthogonal projection from L (il, dV) 2 2 onto the Bergman space La(Q) of holomorphic functions in L (ii, dV). Let P be the orthogonal projection from L (ii, dV) onto the closed subspace of antiholomorphic functions in L (ii, dV). The "little" Hankel operator h, with symbol / is the operator from La(Ci)...
متن کاملComputation by interaction for space-bounded functional programming
We consider the problem of supporting sublinear space programming in a functional programming language. Writing programs with sublinear space usage often requires one to use special implementation techniques for otherwise easy tasks, e.g. one cannot compose functions directly for lack of space for the intermediate result, but must instead compute and recompute small parts of the intermediate re...
متن کاملBounded Holomorphic Functions on Bounded Symmetric Domains
Let D be a bounded homogeneous domain in C , and let A denote the open unit disk. If z e D and /: D —► A is holomorphic, then ß/(z) is defined as the maximum ratio \Vz(f)x\/Hz(x, 3c)1/2 , where x is a nonzero vector in C and Hz is the Bergman metric on D . The number ßf(z) represents the maximum dilation of / at z . The set consisting of all ß/(z), for z e D and /: D —► A holomorphic, is known ...
متن کاملWeakly Symmetric Spaces and Bounded Symmetric Domainshieu
In this paper, new examples of weakly symmetric spaces in the sense of A. Selberg 14] are constructed. Let G be a connected, simply-connected, simple Lie group of hermitian type and K a maximal compactly embedded subgroup of G such that D = G=K is an irreducible classical bounded symmetric domain. Let G 1 and D 1 be circle extensions of G and D, respectively. The factor of automorphy induces a ...
متن کاملResource-Bounded Local Computation
This paper proposes a generic approximation method for solving the problem of inference under limited computational resources. The method is based on the concept of valuation algebras with its wide range of possible instantiations in many different domains. The goal is to construct convenient resource-bounded anytime algorithms, for which the available time to perform the local computations is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1982
ISSN: 0304-3975
DOI: 10.1016/0304-3975(82)90058-5